Single Queueing Systems
ثبت نشده
چکیده
Example 4 Data communication. In computer communication networks standard packages called cells are transmitted over links from one switch to the next. In each switch incoming cells can be buffered when the incoming demand exceeds the link capacity. Once the buffer is full incoming cells will be lost. What is the cell delay at the switches? What is the fraction of cells that will be lost? What is a good size of the buffer?
منابع مشابه
Fuzzy Hierarchical Location-Allocation Models for Congested Systems
There exist various service systems that have hierarchical structure. In hierarchical service networks, facilities at different levels provide different types of services. For example, in health care systems, general centers provide low-level services such as primary health care services, while the specialized hospitals provide high-level services. Because of demand congestion in service networ...
متن کاملA Queueing-Inventory System with Repair Center for Defective Items and One-for-One Ordering Policy
In this paper we consider a system consisting of a supplier with a single processing unit, a repair center, and a retailer with Poisson demand. We assume that the retailer applies one-for-one ordering policy with backorders for his inventory control. The retailer’s orders form a queue in the supplier processing unit. We also assume that a certain fraction of the products produced by the supplie...
متن کاملON THE STARSHAPENESS OF G/G/c QUEUEING SYSTEMS
In this paper we show that the waiting and the sojourn times of a customer in a single-stage, multiple-server, G / G /c queueing system are increasing and starshaped with respect to the mean service time. Usefulness of this result in the design of the optimal service speed in the G / G /c queueing system is also demonstrated. SECOND-ORDER PROPERTIES; SINGLE-STAGE QUEUEING SYSTEMS; STOCHASTIC ST...
متن کاملAnalysis of a Batch Arrival Single Service Queueing System with Unreliable Server and Single Vacation
Many authors have analyzed queueing systems with server breakdowns. Kendall (1953) studied stochastic processes occurring in the theory of queues and their analysis by the method of imbedded Markov chains. Buzacott and Hanifin (1978) classified the machine failures as operation dependent failures and time dependent failures. Shanthikumar (1982) analyzed a M/G/1 queueing system with time and ope...
متن کاملThe Octave Queueing Package
Queueing Networks are a widely used performance modeling tool that has been successfully applied to evaluate many kind of systems. In this paper we describe the queueing package, a collection of numerical solution algorithms for Queueing Networks and Markov chains written in GNU Octave (an interpreted language for numerical computations). The queueing package allows users to compute steady-stat...
متن کاملStatic Optimization of Queueing Systems
This paper discusses some recent developments in the static optimization of queueing systems. Special attention is given to three problem classes: (i) the optimal allocation of servers, or service capacity, to queues in a network; (ii) the optimal allocation of the visits of a single server to several queues (a polling system); (iii) the optimal allocation of a single arrival stream to several ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001